Spanning tree

Results: 445



#Item
21Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile

Minimization of Symmetric Submodular Functions under Hereditary Constraints J.A. Soto (joint work with M. Goemans) DIM, Univ. de Chile

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:20
22On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh†  Bernard Lidick´

On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:58
23Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´

Noname manuscript No. (will be inserted by the editor) Subjective interestingness of subgraph patterns Matthijs van Leeuwen · Tijl De Bie · Eirini Spyropoulou · C´

Add to Reading List

Source URL: www.patternsthatmatter.org

Language: English - Date: 2016-01-15 06:48:18
24CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-10 00:55:12
25Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2  IIT Delhi, India,

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
26Spanning tree / Mathematics / Distributed computing / Minimum spanning tree / Routing / Algorithm

CPSC 455b Written Homework Assignment # 1

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-08-29 17:33:56
27Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2  Irfan Essa1

Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2 Irfan Essa1

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2014-07-16 10:51:30
28Output-Sensitive Construction of the Union of Triangles   Esther Ezra and Micha Sharir School of Computer Science

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2007-08-27 22:45:23
29Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php  SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS*

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2015-11-19 07:35:47
30JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386  Disk-Covering, a Fast-Converging Method

JOURNAL OF COMPUTATIONAL BIOLOGY Volume 6, Numbers 3/4, 1999 Mary Ann Liebert, Inc. Pp. 369– 386 Disk-Covering, a Fast-Converging Method

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2016-05-15 16:25:24